![]() METHOD FOR THE ACQUISITION OF INFORMATION ON THE STATE OF THE CHANNEL AND SYSTEM FOR THE ACQUISITION
专利摘要:
method for acquiring channel state information and system for acquiring channel state information. the acquisition of the following communicates the present invention describes a method for channel state information, including elements: a user equipment (ue) that information about the code-book index and information about the total amount of layers for a base station (enb), where the codebook index information includes one of the following information: class 2 codebook index 1; and codebook index -i- and class 1 index parameter -j-; and after having received the codebook index information and the information about the total amount of layers sent by the eu, wherein the base station obtains a codeword ["codeward"] in the form of looking up a list of predefined codebooks or in the form of querying a predefined codebook list together with calculations according to the codebook index information and the total number of layers information. the present invention further describes a system for acquiring information about the status of the channel. in the present invention, on the one hand, the network side can be compatible for using the state information format of the w .. release channel 8 ["version 8"] (r8) to obtain the multi-antenna function of r8; on the other hand, the network side significantly reduces the quantization errors in the form of a new river code-book, thus dramatically improving the performance of the mu-mimo system. 公开号:BR112012010754B1 申请号:R112012010754-2 申请日:2010-11-02 公开日:2021-06-01 发明作者:Yijian Chen;Jun Xu;Bo Dai;Ruyue Li;Junfeng Zhang 申请人:Zte Corporation; IPC主号:
专利说明:
APPLICATION FIELD The present invention relates to the field of digital communication and, in particular, to a method and system for acquiring channel status information. TECHNICAL BACKGROUND The protocol in the long-term evolution system (LTE) is release 8 (R8) and the information that reflects the channel status information (CSI) has three forms, namely: channel quality indication (CQI), indicator of precoding matrix (PMI) and the class indicator (RI). CQI is an indicator for measuring the quality of the downlink channel. In protocol 36-213, CQI is represented, using an integer value ranging from 0 to 15, which respectively represents the different levels of CQI. Different CQI correspond to the respective modulation forms and coding rates (ie, the modulation coding scheme, MCS) which presents 16 situations in all and which can be represented using 4-bit information. PMI means that only in closed-loop spatial multiplexing transmission mode does the user equipment (UE) indicate to the eNode B (eNB) to use which type of precoding matrix to precode the downlink shared channel (PDSCH) sent to the UE according to the quality of the measured channel. The granularity of the PMI feedback can be such that the full bandwidth feeds back a PMI or the PMI is fed back according to the subband. RI is used to describe the number of independent channels in spatial terms and corresponds to the class of a channel response matrix. According to open loop spatial multiplexing and closed loop spatial multiplexing modes, the UE requires feedback of the RI information, although it does not need to feedback the RI information in other modes. The classification of the channel matrix corresponds to the number of layers of the downlink transmission, so in this way, the UE that is carrying out the feedback of the information from the RI to the eNode B is precisely feeding the number of layers of the downlink transmission. The transport layer is the concept of the multi-antenna "layer" in LTE and LTE-A, it represents the number of effective independent channels in spatial multiplexing and corresponds to the antenna ports in release 10 one by one, with the port of the antenna in release 10 is a logical gate and the total amount of transport layers is exactly the RI. Furthermore, in IEEE802.16m, the layer corresponds to the concept of “MIMO stream” and has the same physical meaning. In the LTE system, CQI, PMI, or RI feedback can be either periodic feedback or non-periodic feedback. CQI and PMI can be sent simultaneously or CQI, PMI and RI can be sent simultaneously. As for the periodic feedback, if the UE does not need to send the data, then the CSI of the periodic feedback is transmitted over the physical uplink control channel (PUCCH) in 2 or 2a or 2b format (PUCCH format2 /2a/2b) and if the UE has to send data, then the CSI is transmitted over the physical uplink shared channel (PUSCH); and, as regards the non-periodic feedback, it is only transmitted over the PUSCH channel. In the scope of the technique, another method is to run the LTE codebook using the respective information from the channel matrix, that is, the mathematical transformation of the R8 release of the codebook, namely: where C represents the codebook obtained after the rotation of CR8 , R = HHH , H is a channel matrix with a dimension of Nr xNt , Nr is the number of receiving antennas and Nt is the number of transmitting antennas. Since the channel matrix information includes the characteristic vector distribution information, the codeword in the codebook will be equally quantized in an area with a relatively higher distribution probability relative to the characteristic vector distribution probability after it. rotated, therefore increasing the accuracy of the quantization. Advanced long-term evolution (LTE-A) as an evolutionary standard for LTE needs to support a larger system bandwidth (up to 100 MHz), while the medium frequency spectrum efficiency and the spectrum efficiency of the frequency of cell edge users need to be increased, so your protocol is release 10 (R10). For this purpose, many new technologies were introduced in the LTE-A system, such as: (1) multiple input and multiple output (MIMO) in high level downlink, the LTE system downlink supports a maximum transmission by 4 antennas per step that the introduction of high-level MIMO allows the LTE-A system to support the transmission of up to a maximum of 8 antennas in the downlink, thus, the number of dimensions of the channel state matrix is increased; (2) multi-point coordinated transmission (CoMP transmission), this technology uses the coordinated transmission of the transmitting antennas of several cells, whereby the UE may need to feed back the channel state information of several cells. Several antennas are used at the transmit terminal (eNB) and the transmission rate can be improved in the form of spatial multiplexing, i.e. different data is transmitted at different antenna locations on the same time frequency resource at the transmit terminal. Several antennas can still be used in the receiving terminal (UE), and all antenna resources can be allocated to the same user as a single user, where this form of transmission is designated as single-user MIMO (SU-MIMO) ; in addition, different antenna space resources can be allocated to different uses as a multi-user, hence this form of transmission is referred to as multi-user MIMO (MU-MIMO). In single transmission mode, the eNB can dynamically select SU-MIMO transmission or MU-MIMO transmission of the downlink according to the channel state information reported, which is designated as dynamic SU/MU MIMO switching. Below, we will describe the general procedure for processing the dynamic switching transmission mode between single-user MIMO and multi-user MIMO as follows: First, the transmit terminal sends a pilot to the user equipment so that this can test the status of the downlink channel, and the user equipment estimates the downlink channel, according to the received pilot information, determining for this purpose the format of the information about the status of the feedback channel and communicating the information about the channel status, whereby the eNB dynamically selects the SU-MIMO transmission of the downlink or the MU-MIMO transmission mode, according to the communicated channel status information, performing the communication depending on the transmission mode that has been selected. As for the transmission mode of dynamic switching between single-user MIMO and multi-user MIMO if, on the one hand, there is a need to maintain backward compatibility in order to support the priority principle of the SU-MIMO and to be compatible with the feedback forms of the CQI/PMI/RI of R8 as far as possible, on the other hand, there is a need to take into account the forward compatibility in order to consider MU-MIMO and COMP support and ensure that the new technology delivers acceptable performance. The accuracy of the communication method of information about the existing channel is quite poor, which makes the eNode B not able to correctly select the downlink channel that is used when sending the data to the UE, leading by This is due to the fact that the MU-MIMO system cannot reach a rational level of WO2007105928 discloses a method for transmitting/receiving feedback information in a multiple antenna system using a closed loop scheme that supports multiple users and a feedback system that supports the same. 3GPP R1-100530 discusses the issue of codebook design for explicit feedback, including that the eigenvector-quantization codebook design can be considered as the baseline of explicit feedback and different eigenvectors have different quantization precisions. 3GPP R1-094582 discusses the feedback mechanisms for SU and MU-MIMO based on vector quantization, including the enhanced feedback mechanisms for Rel. 8 which exploits time/frequency correlation (eg differential feedback) and spatial correlation ( eg adaptive feedback) are introduced and some preliminary simulation results confirm the potential gain of these enhanced feedback techniques. SUMMARY OF THE PRESENT INVENTION The technical problem to be solved by the present invention is to provide a method and system for the acquisition of information about the status of the channel, in order to be compatible with SU-MIMO and MU-MIMO and to guarantee the performance of MU-MIMO system. Aiming to solve the aforementioned technical problem, the present invention provides a method for acquiring information about the channel status, in which said method includes the following elements: A user equipment (UE) that communicates codebook index information and total number of layers information to an eNode B (eNB), wherein the codebook index information includes one of the following information: class 2 codebook index l; and index -i- and the index parameter -j- of the class 1 codebook; After receiving the codebook index information and the information about the total amount of layers sent by the UE, the eNode B obtains a codeword [“codeword”] in the form of querying a codelist. predefined books or in the form of querying a predefined codebook list together with calculations according to the codebook index information and the total number of layers information. The codebook that corresponds to the Class 1 codebook index is a release 8 (R8) codebook or a codebook obtained through a mathematical transformation of the R8 codebook; while the codebook that corresponds to the class 2 codebook index is a new release 10 (R10) codebook. When the code index information comprises the index -i- and the index parameter -j- of the class 1 codebook, during the codeword fetching phase, the eNode B fetches the codeword, making the query the predefined codebook list using the -i- index, the -j- index parameter of the class 1 codebook and the total number of layersU in the form of an index, where the codebook list predefined includes table 1; where relative to table 1, if an index -i- of a codebook of class 1, an index parameter -j- and the total number of layers U are given, then the complex matrixCMativje exclusive ij will then be given directly, where = =0.1,L,2A , j = 0.1,L,2 2 , CMatj represents a codeword of a class 2 codebook and is a complex matrix, 1 and 2 are positive integers greater than 0 and which respectively represent the size of the class 1 code-CMativjbook and the class 2 codebook, where ij is a matrix T or a matrix T ; eNT represents the number of antenna ports of eNode B (eNB). When the code index information comprises the index -i- and the index parameter -j- of the class 1 codebook, during the codeword fetching phase, the eNode B obtains the codeword by referring to predefined codebook list using index -i-, index parameter -j-, of the class 1 codebook and the total amount of layersIn the form of an index, where the predefined codebook list includes table 2; in relation to table 2, if the codebook of class 1 and the quantityU, the complex exclusive complex matrix T , and 1 is a positive integer greater than 0 and representing the size of the codebook of class 1; eNT represents the number of antenna ports of eNode B (eNB). eNode B gets the codeword of the class 1 codebook according to table 1, or it gets the codeword of the class 2 codebook according to table 2. When the code index information comprises index 1 of the class 2 codebook, the index 1 of the class 2 codebook includes a value of the index -i- of the class 1 codebook; during the codeword fetching phase, eNode B fetches the codeword by querying the predefined codebook list using the class 2 codebook index l and the total number of U layers in the form of an index and using the -i- index of the class 1 codebook and the total amount of U layers in the index form, where the predefined codebook list includes table 3 and table 4; in relation to table 3, if the index 1 of the codebook of class u2 is given and the total amount of layers in the unique complex matrixCMatlvl is then given directly,CMatlvl represents complex matrix,CMatlvl is B . NTX1 is a T matrix or an NTX2 matrix, and l=0.1,L,2NB1+NB21 and 2 are integers with respect to the class 1 codebook table and higher positives4 if given a total amount than 0; and the layer index there is a complex matrix that corresponds exclusively is a function ofN T X u, NB1 is an AActivi , where i = func(l)representsAActivl, i represents a positive integer matrix greater than -i-complex0 and that represents the size of the codebook number of antenna ports of class 1; where T is aeNode B (eNB). The eNode B gets the codeword of the codebook of class 2 according to the codebook of classi = func(l)represents the table 3, gets the codeword of roundingDuring the formphase of a query Aset with the calculation, according to table 4.i= floor(1/2NB1), where floordown. Obtaining the codeword list of the predefined codebookthe class 2 codeword obtained in the form of a rotation algorithm or phase adjustment algorithm. During the form phase of a query together with the calculation, in addition to obtaining the codeword list of the predefined codebook, the class 2 codeword obtained in the form of a rotation algorithm and phase adjustment algorithm, the which comprises the following elements: a part of the codeword in the class 2 codebook is obtained by calculation using the rotation algorithm; while another part of the codeword in the class 2 codebook is obtained by calculation using the phase adjustment algorithm. The rotation algorithm means multiplying the rotation matrix by the codeword in a predetermined codebook B to obtain the codeword of the class 2 codebook. The predetermined codebook B is obtained by compressing all codewords into a known codebook C, whereby compression means multiplying the compression matrix by the codebook C. The C codebook is a class 1 codebook or other codebook provided by a protocol, and if the C codebook is a class 1 codebook, then the size of the C codebook is the size of the Class 1 codebook, where the codeword of the C codebook is the codeword of the Class 1 codebook. The phase of obtaining codebook B by compressing codebook C includes the following elements: obtaining codebook B by calculation, using the following formula: CWB( j) = MatCmprs( j) • CWC( j)where CW B(j) represents the j° codeword of codebook B, CWC(j) represents the j° codeword of codebook C, codebook index j = 0.1,L, NBC , NBC is a positive integer greater than 1, CWB(j) represents the j° codeword of codebook B, and MatCmprs(i) is a matrix , ■ , N Nx NT constant, represents the compression ratio and is a real positive number, and where β represents an absolute value of a first element of the codeword CWC( j) . The way to obtain the class 2 codebook by rotating codebook B comprises the following elements: obtaining the class 2 codebook by calculation, using the following formula: CW2( i, j) = MatRot (i ) • CWB( j) Where i is a codebook index of class 1i = 0.1,L, NB1 , the codebook index j = 0.1,L, NBC , CWB(j) represents j° codeword of codebook B, CW2(i, j) represents the jth codeword in the NBC codewords obtained by rotating the ith codeword of the class 1 codebook, NBC is the number of codewords in a codebook B collection, MatRot(i) is a function of CW1(i) , CW1(i) represents the ith codeword of the class 1 codebook, MatRot(i) is a unit matrix [ ^^ ^^) ^CW1(i) ] or .... [ conj (CW1(i)) OCwi(i) 1 , . . , ,a unit matrix CW1(i) obtained according to Cw1(i) , where conj(Cw1(i)) represents to conjugate Cw1(i) , and O.. Cw1(i) represents the column vector (NT-1 )° orthogonal with Cw1(i)where HH represents the Household Transformation, H is [1 0 0 0] , and NB1 and NBC are positive integers greater than 1. The phase adjustment algorithm means the following: performing the phase adjustment on each element in the class 1 codebook codeword to finally obtain NJ codewords from the class 2 codebook, NJ is a positive integer greater than 1, where phase adjustment means multiplying the phase adjustment matrix by the codeword of the class 1 codebook and where the phase adjustment matrix is generated according to the code word of the codebook of class 1. The phase adjustment is performed using the following formula: CW2(i, j) = MatPhsAj)• CW1(i), where CW1(i) represents the i° codeword of the codebook of class 1, and where MatPhsAdj( j) is a diagonal matrix, 0j 1j (NT -1) j respectively represent to carry out the phase adjustment in the first to the NT° element whose values are in the range of 0 to 2π or from -π to +π, CW2(i, j) represents to perform the adjustment from phase in the ith codeword of the class 1 codebook to get the jth codeword in NJ codewords. The Y0j,Y1j,L ,Y(NT -1) j satisfies Yij = (i +1) •θj , where i = 0.1,L,NT-1 , j = 0.1,L, NJ , and θj is a phase value, which is in the range 0 to 2π or from -π to +π, and NJ is a positive integer greater than 1. The method further comprises the following elements: the eNode B which schedules the UE by designating the obtained codeword by selecting the downlink transmission form to communicate with the UE, wherein the downlink transmission form comprises one of the following elements: transmission mode inputs multiple output multiple for single user, multiple input multiple output transmission mode for multiple users, dynamic switched transmission mode for single user/multiple users, and multi-point coordinated transmission mode. In order to solve the aforementioned technical problem, the present invention also presents a system for acquiring information about the channel status, comprising a user equipment (UE) and an eNode B, in which the UE is configured to communicate the codebook index information and the total number of layers information for eNode B, where the codebook index information includes one of the following information: codebook index l class 2; and index -i- and the index parameter -j- of the class 1 codebook; ewherein the eNode B is configured to, after having received the information about the codebook index and the information about the total amount of layers sent by the UE, to obtain a codeword [“codeword”] in the form of a query of a predefined codebook list or in the form of querying a predefined codebook list together with calculations according to the codebook index information and the total number of layers information. In the method according to the present invention, when the user equipment sends the channel status information to the network side, the codebook index information is carried in this information to indicate the downlink channel status information, of so that, on the one hand, the network side can be compatible for using the channel state information format of R8 to achieve the multi-antenna function of R8, e.g., single-user MIMO; on the other hand, the network side significantly reduces quantization errors by means of a new R10 code-book, thereby sharply increasing the performance of the MU-MIMO system. Through the new method for the generation and representation of the new code-book, the transmission efficiency and the transmission quality can be improved, thus solving the problem related to the lack of accurate information of the MU-MIMO about the channel state. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a communication process of a single-user MIMO or multiple-user MIMO using the codebook generation method contained in Preferred Embodiment 1; and Fig. 2 is a communication process of a single-user MIMO or multiple-user MIMO using the codebook generation method contained in Preferred Realization 2. PREFERRED ACHIEVEMENTS OF THE PRESENT INVENTION In order to achieve higher peak frequency spectrum efficiency in the LTE-A system, downlink requires supporting dynamic switching between single-user MIMO and multi-user MIMO. On the one hand, the feedback control that signals the channel information needs to maintain backward compatibility in order to support the SU-MIMO priority principle and to be compatible with the CQI feedback forms /PMI/RI of release 8 already exists as far as possible and, on the other hand, there is a need to take into account the forward compatibility for the channel information feedback channel status , so there is a need to develop a new R10 codebook to improve the feedback accuracy, in order to promote the support of MU-MIMO and COMP and to ensure that the new technology presents an acceptable performance. The present invention describes an inventive concept of the method for acquiring channel status information, including the following elements: A user equipment (UE) that communicates codebook index information and total quantity information from layers to an eNode B (eNB), where the codebook index information includes one of the following information: -i- index of the class 1 codebook; index 1 of the class 2 codebook; and class 1 codebook index -i- and index parameter -j-; and after receiving the code-book index information and the information about the total amount of layers sent by the UE, wherein eNode B obtains a codeword ["codeword"] (precoding matrix) in the form of queries a list of preset codebooks or in the form of querying the preset codebook list together with calculations according to codebook index information and total number of layers information. The eNode B performs the scheduling in the UE, designating the obtained codeword and selecting the transmission mode of the downlink to communicate with the UE. The downlink transmission mode includes one of the following elements: SU-MIMO transmission mode, MU-MIMO transmission mode, single-user/multi-user dynamic switched transmission mode, and multi-point coordinated transmission (COMP) mode. Normally, after receiving the pilot information, the UE calculates the downlink channel to obtain a calculation value thereof, then acquiring the codebook index information by querying a list of a current codebook, employing the value. downlink channel calculation, where the information about the codebook index includes one of the following information: -i- index of the class 1 codebook; index 1 of the class 2 codebook; and index -i- and the class 1 codebook index -j- parameter. The class 1 codebook index and the class 2 codebook index correspond to different transmission modes respectively. After acquiring the code index information, the UE sends the codebook index information and the total amount of layers information to the eNode B. The sending to the eNode B by the UE can be periodic or not. -periodical. The codebook that corresponds to the Class 1 codebook index is an R8 codebook or a codebook obtained by mathematically transforming the R8 codebook; while the codebook that corresponds to the class 2 codebook index is a new codebook in R10. The aforementioned user equipment and eNode B have the same codebook list. When the codebook index information is the index -i- and the index parameter -j- of the class 1 codebook, the eNode B then proceeds to query the predefined codebook list using the -i-, -j- and the total amount of U-layers in the form of the index, where the codebook list includes a first table (hereinafter referred to as Table 1) and a second table (hereinafter referred to as Table 2), and where the eNode B gets the codeword of the class 1 codebook when querying the first table, acquiring the codeword of the class 2 codebook when querying the second table, which is especially compliant follows: The first table includes the -i- index of the class 1 codebook, the total number of U layers, and the codeword of the class 1 codebook. If the -i , U index of the code- is given. class 1 book and the total amount of AMatv layers, the unique complex matrix i will then be determined directly, where = , , L, , i represents the word. rade code of the class 1 codebook and is a complex matrix representing the size of the class 1 codebook; and the second table includes the -i- index and the -j- parameter of the class 1 codebook, the total amount of layers and the codeword of the class 2 codebook. -j- parameter of the class 1 codebook and the total number of layers , the complex matrixCMativje exclusive ij will then be determined directly, where, ij represents the codeword of the class 2 codebook and is a complex matrix, which they represent respectively the size of the CMativjclass 1 codebook and the class 2 codebook; where ij is aT matrix or a T matrix. The size of ij in the second table depends on the antenna configuration and the channel relevance, and in general, for example, if the channel relevance is high or if the antenna is of typeCMativjuniform linear antenna network (ULA), the size of ijN N X1will be of T . The second table can include the case where some codebooks are missing. When the information about the codebook index is index 1 of the class 2 codebook, the eNode B then proceeds to query the predefined codebook list using l and the total amount of U layers as well as -i- and U in index form, where the class 2 codebook index l includes the value of the class 1 codebook index -i-, where the predefined codebook list includes a third table ( hereinafter referred to as Table 3) and a fourth table (hereinafter referred to as Table 4), and in which the eNode B obtains the codeword of the class 2 codebook by querying the third table, thus obtaining the codeword of the class 1 codebook by querying the fourth table, which in particular includes the following: the third table includes the class 2 codebook index l, the total number of U layers, and the codeword of the codebook of class 2. If the index l of the codebook of class 2 and the total number of layers U are given, the complex matrix exclusiveCMatlv will then be determined directly. Where,CMatlv represents the complex matrix,l = 0.1,L,2NB1+NB2NB11 andNB2are positive integers greater than 0; eCMatlvumaNT X1 matrix or matrix NTX2In the third table, theCmatlvsize of l depends on the antenna configuration and the channel relevance, with a general form, by way of example, if the channel relevance is high or if the uniform forlinear antenna (ULA), the size of the third table can include the caseare missing. The fourth table includes a class 1, the total quantity of the antenna network type C atlv which index, . NT X1 .will be from T . A few codebooks-i- of the U-layer codebook beyond the codeword of the class 1 codebook, and if given the -i- index of the class1 codebook, the total amount of. The corresponding layers will both have an AMativ, where i=func(l)single complex matrix, which represents that AMativ-i- is a function of l, i represent , 1 is an integer represents the size number of gates and i= floor(1 / 2NB1) rounding to 0 Nt is meaning, being positive in the codebook of the class-complex matrix antenna dode greater than 0 and greater than NT1; where T is aeNode B (eNB). The i = func(l)where floor represents the low.NT shown here that both represent have the same number of ports of the transmitting antenna. After having obtained the codeword of the codebook of class 1 by carrying out the table look-up, the determination of the codeword for the codebook of class 2 can also be obtained by means of calculation. It can be obtained using the rotation algorithm, as it can be obtained by the phase adjustment algorithm, or even obtained by the rotation algorithm and phase adjustment algorithm (the part of the codeword in the class 2 codebook is obtained by the rotation algorithm, while the other part of the class 2 codebook is obtained by the phase adjustment algorithm). Code index information and information about the total number of layers can be sent to eNode B in the form of different messages, and the time of sending them can be the same or different. Similarly, the class 1 codebook index and the class 2 codebook index mentioned above can be sent to eNode B simultaneously, as well as not being sent to eNode B simultaneously, so both have your own shipping periods, these periods may be the same or different. Hereinafter, the method according to the present invention will be described in conjunction with the AMati preferred embodiments. In this case, the codebook i of class 1 is an R8 codebook, or it is a codebook obtained after mathematical transformation based on the codebook of R8, the codebook 1 of class 2 or ij is a codebook of R10, therefore, class 1 codebook index is used as SU-MIMO codeword index, so class 2 codebook index can be used not only as word index SU-MIMO code word index, but also as MU-MIMO code word index, that is to say, it can be used either for MU-MIMO transmission mode or SU-MIMO transmission mode. In the preferred embodiments described below, the class 1 codebook index is represented by -i-, the class 2 codebook index is represented by 1, while the total number of layers is represented by U. simultaneously transport the class 1 codebook index and the class 2 codebook index using 8 bits, 4 consecutive bits in 8 bits can be set as the value of -i-, where this value of -i- and the other value -j- of 4 consecutive bits are used as the value l. PREFERRED ACHIEVEMENT 1 In the present preferred embodiment, the code index information sent by the UE to the eNode B only includes the class 1 codebook index, whereby the eNode B determines the codeword in a class 1 codebook in the form of precoding matrix, by querying the table according to the -i- index of the class 1 codebook and the total amount of U layers. More particularly, eNode B uniquely determines a complex matrix in precoding matrix form by querying a table in the class 1 predefined codebook list according to -i- and matching the reference in Table 1 for the Class 1 codebook list examples. The uniquely determined class 1 complex matrix is represented by the corresponding complex matrix of different. Hereafter, we will present another more specific example: assuming that the number of transmit antenna ports is NT = 4, that u = 1 and -i- are given, then the codeword of the class 1 codebook will be defined, as follows: i = 0; CW1 = [0.5, 0.5, 0.5, 0.5] Ti = 1; CW1 = [0.5, 0 + 0.5i, -0.5, 0 - 0.5i]Ti = 2; CW1 = [0.5, -0.5, 0.5, -0.5]Ti = 3; CW1 = [0.5, 0-0.5i, - 0.5, 0 + 0.5i]Ti = 4; CW1 = [0.5, 0.35355 + 0.35355i, 0 + 0.5i, -0.35355 + 0.35355i]T i = 5; CW1 = [0.5, -0.35355 + 0.35355i, 0 - 0.5i,0.35355 + 0.35355i]T i = 6; CW1 = [0.5, -0.35355 - 0.35355i, 0 + 0.5i,0.35355 - 0.35355i]T i = 7; CW1 = [0.5, 0.35355 - 0.35355i, 0-0.5i, -0.35355 - 0.35355i]T i = 8; CW1 = [0.5, 0.5, -0.5, -0.5]T i = 9; CW1 = [0.5, 0 + 0.5i, 0.5 , 0 + 0.5i]T i = 10; CW1 = [0.5, -0.5, -0.5, 0.5]T i = 11; CW1 = [0.5, 0 - 0.5i, 0. 5, 0 - 0.5i]T i = 12; CW1 = [0.5, 0.5, 0.5, -0.5]T i = 13; CW1 = [0.5, 0.5, -0.5, 0.5]T i = 14; CW1 = [0.5, -0.5, 0.5, 0.5]T i = 15; CW1 = [0.5, -0.5, -0.5, -0.5]T It should be noted that the present invention is not restricted to the values mentioned above. PREFERRED ACHIEVEMENT 2 In the present preferred embodiment, the code index information sent by the UE to the eNode B includes -i- and -j-, whereby the eNode B determines the codeword in a class 2 codebook in matrix form. of precoding, when querying the table according to the index -i-, -j- and with U .In particular, eNode B uniquely determines theCMativjcomplex matrix ij of class 2 in the form of precoding matrix when proceeding to querying a table in the class 2 predefined codebook list according to -i-, -je with U , where the reference can Table 2 for the illustration of the list dei = 0.1,L,2NB1 , j = 0.1,L,2NB2 , NB1 and NB2 are positive integers greater than 0 and represent respectively the size of the class 1 codebook and that of the class 2 codebook. i- or different -j- or to different U, the corresponding complex matrix of class 2 is equally different. bake 2 with -i-, -j- and U being the index the configuration of the antenna and the relevance of the channel, being generally, by way of example, when the relevance of the channel is high or when the antenna is of the line network type, then the size of ij will be TCMativj As for the class 2 codeword, i is missing in some values of -i- and -j-. If eNode B is to schedule the UE as MU-MIMO transmission mode or as dynamic switching transmission mode of SU/MU, or else COMP stream mode, then class 2 codebook index will need to be used in combination with class 1 codebook index. Hereinafter, we will present another more specific example: assuming that the number of transmit antenna ports is NT = 4, then the class 2 codebook will be defined directly in R10, and if some code index class is given -book, some index value of the class 2 codebook and some value of the total amount of layers, then the corresponding complex matrix can be directly defined in R10, that is, the codeword of the class 2 codebook. For example, assuming that the total known number of layers is u =1, that the class 1 and class 2 codebook indices are respectively indicated as -i- and as -j-, 1 2 , then the word The code word of the class 2 codebook will be indicated as CW2, while the codeword of the class 1 codebook will be indicated as CW1.u =1 and -i- are given, matching the reference with the definition from the class 1 codebook codeword in Preferred Embodiment 1 to the definition in the class codebook codeword 1.u =1, -i-, and -j- are given, where the word class 2 codebook code is defined as follows: i =0, j =0; CW2 = [0.82569, 0.32569, 0.32569, 0.32569]Ti = 0, j =1; CW2 = [0.32569, 0.57569-0.25i,0.32569, 0.57569+0.25i]Ti = 0, j =2; CW2 = [0.32569, 0.32569, 0.82569, 0.32569]Ti = 0, j =3; CW2 = [0.32569, 0.57569+0.25i,0.32569, 0.57569-0.25i]Ti=0, j =4; CW2 = [0.45069-0.30178i,0.62747+0.125i, 0.45069+0.051777i, 0.27392+0.125i]Ti=0, j =5; CW2 = [0.45069-0.051777i, 0.27392-0.125i, 0.45069+0.30178i, 0.62747-0.125i]Ti = 0, j =6; CW2 = [0.45069+0.051777i,0.27392+0.125i, 0.45069-0.30178i, 0.62747+0.125i]Ti = 0, j =7; CW2 = [0.45069+0.30178i, 0.62747-0.125i, 0.45069-0.051777i, 0.27392-0.125i]Ti = 0, j =8; CW2 = [0.32569, 0.82569, 0.32569,0.32569]Ti=0, j =9; CW2 = [0.57569-0.25i, 0.32569,0.57569+0.25i, 0.32569]Ti =0, j =10; CW2 = [0.32569, 0.32569, 0.32569.0.82569]Ti=0, j =11; CW2 = [0.57569+0.25i, 0.32569,0.57569-0.25i, 0.32569]Ti =0, j =12; CW2 = [0.57569, 0.57569, 0.57569, 0.075694]Ti = 0, j =13; CW2 = [0.57569, 0.57569, 0.075694, 0.57569]Ti = 0, j =14; CW2 = [0.57569, 0.075694, 0.57569.0.57569]Ti = 0, j =15; CW2 = [0.075694, 0.57569, 0.57569.0.57569]Ti =1, j=0; CW2 = [0.32569, 0.25-0.57569i, - 0.32569, 0.25+0.57569i]Ti =1, j =1; CW2 = [0.82569, 0-0.32569i, -0.32569, 0+0.32569i]Ti =1, j =2; CW2 = [0.32569, -0.25-0.57569i, -0.32569, -0.25+0.57569i]Ti =1, j =3; CW2 = [0.32569, 0-0.32569i, -0.82569, 0+0.32569i]Ti =1, j =4; CW2 = [0.45069+0.30178i, -0.125-0.62747i, -0.45069+0.051777i, 0.125+0.27392i]Ti =1, j =5; CW2 = [0.45069-0.30178i, 0.125-0.62747i, -0.45069-0.051777i, -0.125+0.27392i]Ti =1, j =6; CW2 = [0.45069-0.051777i, -0.125-0.27392i, -0.45069-0.30178i, 0.125+0.62747i]Ti =1, j =7; CW2 = [0.45069+0.051777i, 0.125-0.27392i, -0.45069+0.30178i, -0.125+0.62747i]Ti =1, j =8; CW2 = [0.57569+0.25i, 0-0.32569i, -0.57569+0.25i, 0+0.32569i]Ti =1, j =9; CW2 = [0.32569, 0-0.82569i, -0.32569, 0+0.32569i]Ti =1, j =10; CW2 = [0.57569-0.25i, 0-0.32569i, - 0.57569-0.25i, 0+0.32569i]Ti =1, j =11; CW2 = [0.32569, 0-0.32569i, -0.32569, 0+0.82569i]Ti =1, j =12; CW2 = [0.32569+0.25i, 0-0.57569i, - 0.32569+0.25i, 0+0.57569i]Ti =15, j=0; CW2 = [0.075694, -0.57569, -0.57569, -0.57569]Ti =15, j =1; CW2 = [0.57569, -0.32569-0.25i, -0.57569, -0.32569+0.25i]Ti =15, j =2; CW2 = [0.57569, -0.57569, -0.075694, -0.57569]Ti =15, j =3; CW2 = [0.57569, -0.32569+0.25i, - 0.57569, -0.32569-0.25i]Ti =15, j =4; CW2 = [0.45069+0.30178i, -0.27392+0.125i, -0.45069+0.051777i, -0.62747+0.125i]Ti =15, j =5; CW2 = [0.45069+0.051777i, -0.62747-0.125i, -0.45069+0.30178i, -0.27392-0.125i]Ti =15, j =6; CW2 = [0.45069-0.051777i, -0.62747+0.125i, -0.45069-0.30178i, -0.27392+0.125i]Ti =15, j =7; CW2 = [0.45069-0.30178i, -0.27392-0.125i, -0.45069-0.051777i, -0.62747-0.125i]Ti =15, j =8; CW2 = [0.57569, -0.075694, -0.57569, -0.57569]Ti =15, j =9; CW2 = [0.32569+0.25i, -0.57569, - 0.32569+0.25i, -0.57569]Ti =15, j =10; CW2 = [0.57569, -0.57569, -0.57569, -0.075694]T i =15, j =11; CW2 = [0.32569-0.25i, -0.57569, - 0.32569-0.25i, -0.57569]Ti =15, j =12; CW2 = [0.32569, -0.32569, -0.32569, -0.82569]Ti =15, j =13; CW2 = [0.32569, -0.32569, -0.82569, -0.32569]Ti =15, j =14; CW2 = [0.32569, -0.82569, -0.32569, -0.32569]Ti =15, j =15; CW2 = [0.82569, -0.32569, -0.32569, -0.32569]T It should be noted very particularly that the codeword value of the class 2 codebook and the codeword value of the class 1 codebook are not limited to the examples that have been presented above. PREFERRED ACHIEVEMENT 3 In this preferred embodiment, the code index information sent by the UE to the eNode B is the index 1 of the class 2 codebook, whereas the eNode B determines the codeword of the class 2 codebook in the form of precoding matrix according to 1 and com .In particular, eNode B uniquely determines CMatlv complex matrix 1 of class 2 by querying datatable in the predefined codeword list of class 2 according to 1 and U, confronting reference is made to Table 3 for the illustration of the class 2 codebook in which l and U are used as an index; Matj represents the complex matrix, that is, the codeword in the class 2 codebook, where /=0.1,L,2NB1+NB2 , NB1 and NB2 are positive integers greater than 0, and where / is a matrix T or matrix T . The size of l depends on the antenna configuration and the channel relevance, being generally, by way of example, when the channel relevance is high or when the antenna is of the linear network type. eNode B obtains the index -ido- codebook of class1 by means of calculation according to i and obtains the exclusive complex AMativ matrix i by querying the table of the predefined codebook list of class 1 according to the total amount of layers U obtained by means of calculation. In this preferred embodiment, the codebook list of class 1 is the one in Table 4, where i = func(l), where it represents that -i- is a function of le, in the present preferred realization, i = func(l)i= floor(1 / 2NB1) , in which floor represents roundingdown; and, in other preferred embodiments, function relationships can also be used. Class 1 Ncode-book; where t is the antenna quantity of eNode B Hereinafter, we will present another more specific example: assuming that the total number of layers u =1, the class 2 codebook index is indicated as 1, and that the class 2 codebook index is 10 indicated as CW2, u =1 and l are known, so the codeword definition of the class 2 codebook will be as follows: i =0; CW1 = [0.82569, 0.32569, 0.32569, 0.32569] T 1 =1; CW2 = [0.32569, 0.57569-0.25i, 0.32569,0.57569+0.25i]Tl =2; CW2 = [0.32569, 0.32569, 0.82569, 0.32569]Ti =3; CW2 = [0.32569, 0.57569+0.25i, 0.32569,0.57569-0.25i]Tl =4; CW2 = [0.45069-0.30178i, 0.62747+0.125i,0.45069+0.051777i, 0.27392+0.125i]Tl =253; CW2 = [0.32569, -0.32569, -0.82569, -0.32569]Ti =254; CW2 = [0.32569, -0.82569, -0.32569, -0.32569]T1 =255; CW2 = [0.82569, -0.32569, -0.32569, -0.32569]T At this point, if the index l of the class 2 codebook is known, then the index -i- of the class 1 codebook can be determined, that is to say, l can determine the codeword of the codebook of class 1, for example, i = floor(l / 2 1) , Table 1 can be used accurately to obtain the codeword of the corresponding class 1 codebook, so the determination of the codeword of the class 1 codebook when l is known is as follows: i =0; CW1 = [0.5, 0.5, 0.5, 0.5] Tl = 16 -> 31; CW1 = [0.5, 0+0.5i, -0.5, 0-0.5i]Tl = 32 -> 47; CW1 = [0.5, -0.5, 0.5, -0.5]Tl = 48 -> 63; CW1 = [0.5, 0-0.5i, -0.5, 0+0.5i]Tl = 64 -> 79; CW1 = [0.5, 0.35355+0.35355i,0+0.5i, -0.35355+0.35355i]Tl = 80 -> 95; CW1 = [0.5, -0.35355+0.35355i, 0-0.5i, 0.35355+0.35355i]Tl = 96 -> 111; CW1 = [0.5, -0.35355-0.35355i, 0+0.5i, 0.35355-0.35355i]T 1 = 112 -> 127; CW1 = [0.5, 0.35355-0.35355i, 0-0.5i, -0 35355-0.35355i]T 1 = 128 -> 143; CW1 = [0.5, 0.5, -0.5, -0.5]T1 = 144 -> 159; CW1 = [0.5, 0+0.5i, 0.5, 0+0.5i]Tl = 160 -> 175; CW1 = [0.5, -0.5, -0.5, 0.5]Tl = 176 -> 191; CW1 = [0.5, 0-0.5i, 0.5, 0-0.5i]Tl = 192 -> 207; CW1 = [0.5, 0.5, 0.5, -0.5]Tl = 208 -> 223; CW1 = [0.5, 0.5, -0.5, 0.5]Tl = 224 -> 239; CW1 = [0.5, -0.5, 0.5, 0.5]Tl = 240 -> 255; CW1 = [0.5, -0.5, -0.5, -0.5]TWhere, l = 0 -> 15 represents that the value of l is a number in the range 0 to 15, and so on, where l is a positive integer equal to or greater than 1. It should be noted very particularly that the codeword value of the class 2 codebook and the codeword value of the class 1 codebook are not limited to the examples that have been presented above. PREFERRED ACHIEVEMENT 4 The present preferred embodiment essentially describes how to generate the codeword of the class 2 codebook by means of the rotation algorithm according to the codeword of the class 1 codebook, and the constant method of this preferred embodiment can be used alongside the methods described in Preferred Embodiments 2-3 cited above. The rotation algorithm means multiplying the rotation matrix by the codeword in a predetermined codebook B to obtain the codeword of the class 2 codebook. The predetermined codebook B is obtained through compression of all codewords in a known C codebook, so compression means multiplying the compression matrix by the C codebook. This C codebook can be a class 1 codebook or another codebook provided by the protocol . In particular, eNode B presents a known C codebook according to the rotation compression algorithm, for a codeword of the class 1 codebook A, the codeword of the class 2 NBC codebooks is obtained after calculation, where NBC is a positive integer greater than 1; and the phase of obtaining the codeword of the class 2 codebook by means of calculation contemplates the following phases. In phase (1), codebook B is obtained by compressing all codewords in a given codebook C; the compression operation is carried out by multiplying a compression matrix by the codeword of another C codebook; It should be noted that in this case the codebook C then given is a class 1 codebook or another codebook provided by the protocol. If the C codebook shown is a class 1 codebook, then the size of the C codebook will be that of the class 1 codebook, so the codeword of the C codebook will be that of the codebook of class 1. In step (2), each codeword in the class 1 codebook A has a corresponding rotation matrix, and the codeword in the class 2 codebook can then be obtained by multiplying the rotation matrix by each codeword of codebook B; it should be noted in this case that the present invention further includes a codebook B provided by the protocol, the class 2 codeword being obtained only through step (2); and the present invention also includes a C codebook provided by the protocol, the class 2 codeword being obtained by directly performing the rotation compression operation in C. The compression operation is described using the following formula: CWB( j) = MatCmprs( j) • CWC( j) where, CWC(j) represents the j° code-book code word C, code-book index j = 0.1,L, NBC , NBC is a positive integer greater than 1, CWB(j) represents the jth codeword of codebook B, and MatCmprs(i) is a matrix,. π x, NX Ndiagonal, where its size is T T1- - a2 (1 -β)/βMatCmprs( j) =where α is a constant that represents the compression rate and is a positive real number, and β represents the absolute value of first element of codeword CWC(j) The rotation operation is described by the following formula: CW2( i, j) = MatRot (i) • CWB( j) where class 1 codebook index i =0.1 codebook index j = 0.1 ,L, NBC , CWB(j) represents the j° codeword of codebook B, CW2(i, j) represents the j° codeword among the NBC codewords obtained by rotating the 1st codeword of the code -book of class 1, and where NBC is the number of codewords in codebook B collection. MatRot(i) is a function of CW1(i) , CWB(j) represents the ith codeword of the class 1 codebook; according to CW1(i) or the unit matrix I-conj(CW1(i)) ^CW1(i)] ,conj(CW1(i)) represents to conjugate CW1(i) , and CW1(i) represents the vector of column (NT-1) ° orthogonal with CW1(i) .The rotation operation is described by the following formula: where CWi(i) is one column,MatRot(i) = HH (H -CWi(i)). HH represents the Household Transform, H is [1 0 0 0]T , and NB1 and NBC are positive integers greater than 1. The UE is under the SU-MIMO transmission mode or under the MU-MIMO transmission mode, or even the hybrid transmission mode of SU-MIMO and MU-MIMO, the UE obtains the downlink channel information by measurement, compares the channel information obtained by measuring with the codeword, by querying a predefined list, selects the closest codeword, and uses its codeword index as the PMI to be fed back to the eNB. Hereinafter, we will present another more specific example: assuming that the number of transmit antenna ports is NT = 4, then the class 2 codebook will be defined directly in R10, and if any codebook index class is given , some index value of the codebook of class 2 and some value of the total amount of layers, the corresponding complex matrix can be defined directly in R10, that is, the codeword of the codebook of class2. For example, assuming that the total known number of layers is u =1, the class 1 and class 2 codebook indices are respectively indicated as -i- and as -j-, ^^1 ^^2 , then the codeword of the class 2 codebook will be indicated as CW2, while the codeword of the class 1 codebook will be indicated as CW1.u = 1 and -i- is given, and the codebook of class 1 will be an R8 codebook.The collection of codewords B can be achieved by compressing all codewords into another given codebook C; whereby the compression operation is put into practice by multiplying a compression matrix by the codeword of another C codebook; the collection of C codewords is given directly and is an R8 codebook; its definition is shown below:IndexC =0, CWC(0) = [0.5, 0.5, 0.5, 0.5]T;IndexC =1, CWC(1) = [0.5, 0+0.5i, -0.5, 0-0.5 i]T;IndexC =2, CWC(2) = [0.5, -0.5, 0.5, -0.5]T;IndexC =3, CWC(3) = [0.5, 0-0.5i, -0.5,0+0.5i ]T;IndexC =4, CWC(4) = [0.5, 0.35355+0.35355i,0+0.5i, -0.35355+0.35355i]T;IndexC =5, CWC(5) = [0.5, -0.35355+0.35355i , 0-0.5i, 0.35355+0.35355i]T;IndexC =6, CWC(6) = [0.5, -0.35355-0.35355i, 0+0.5i, 0.35355-0.35355i]T;IndexC =7, CWC(7 ) = [0.5, 0.35355-0.35355i, 0-0.5i, -0.35355-0.35355i]T;IndexC =8, CWC(8) = [0.5, 0.5, -0.5, -0.5]T;IndexC =9 , CWC(9) = [0.5, 0+0.5i, 0.5, 0+0.5i]T;IndexC =10, CWC(10) = [0. 5, -0.5, -0.5, 0.5]T;IndexC =11, CWC(11) = [0.5, 0-0.5i, 0.5, 0-IndexC =12, CWC(12) = [0.5, 0.5, 0.5, - 0.5]T;IndexC =13, CWC(13) = [0.5, 0.5, -0.5, 0.5]T;IndexC =14, CWC(14) = [0.5, -0.5, 0.5, 0.5]T;IndexC =15, CWC(15) = [0.5, -0.5, -0.5, -0.5]T; In this case, IndexC represents the codebook index of the C codeword collection, CWC (IndexC) is the (IndexC) codeword in the C codeword collection, while IndexC is a positive integer greater than or equal to aThe collection of codewords B is obtained through the compression operation in the collection of codewords C and can be obtained by multiplying the matrix, as follows: Where, IndexB = 0.1, 2,L, 2 , a is a constant representing the compression ratio and is a positive real number, and β represents the first element of the codeword where 2NBB is the total number of codewords of the codewords in the C codebook, and represents the matrix transposition operation. There is a more specific example, where α= 0.5 and α= 0.5 .The collection of codeword B is obtained as below: IndexB =0; CWB = [0.90139, 0.25, 0.25, 0.25]TIndexB =1; CWB = [0.90139, 0+0.25i, -0.25, 0-0.25i]TIndexB =2; CWB = [0.90139, -0.25, 0.25, -0.25]T IndexB =3; CWB = [0.90139, 0-0.25i, -0.25.0+0.25i]T IndexB =4; CWB = [0.90139, 0.17678+0.17678i,0+0.25i, -0.17678+0.17678i]T IndexB =5; CWB = [0.90139, -0.1 7678+0.17678i, 0-0.25i, 0.17678+0.17678i]T IndexB =6; CWB = [0.90139, - 0.17678-0.17678i,0+0.25i, 0.17678 -0.17678i]T IndexB =7; CWB = [0.90139, 0.17678-0.17678i, 0-0.25i, -0.17678-0.17678i]T IndexB =8; CWB = [0. 90139, 0.25, -0.25, -0.25]T IndexB =9; CWB = [0.90139, 0+0.25i, 0.25.0+0.25i]T IndexB =10; CWB = [0.90139, -0.25, -0.25, 0.25]T IndexB =11; CWB = [0.90139, 0 -0.25i, 0.25, 0-0.25i]T IndexB =12; CWB = [0.90139, 0.25, 0.25, -0.25]T IndexB =13; CWB = [0.90139, 0.25, -0.25, 0.25]T IndexB =14; CWB = [0.90139, -0.25, 0.25, 0.25]T IndexB =15; CWB = [0.90139, -0.25 , -0.25, -0.25]T In this case, IndexB is the codebook index of codeword B collection, and CWB is a codeword of codeword B collection. Furthermore, if the B codeword collection is known, then the codeword of the class 2 codebook can be obtained through the rotation operation. In particular, the codeword of the class 2 codebook can be obtained by matrix multiplication, as follows: CW2 (i, j ) = Matmt (i )• CWB (j) i = 0.1.2 ,L, NB1 j = 0.1,2,-, NB 2 As for the definition of the rotation matrix, more particularly, we present an example, assuming that the number of transmit antenna ports is 4 and that the level 1 codebook in the example above has 16 code words, which is essentially the R8 codebook. The un-codeword collection is known, and its definition is as follows: n=0; Un(n) = [1, -1, -1, 1]T n =1; Un(n) = [1, 0-1i, 1, 1]T n =2; Un(n) = [1, 1, -1, 1]T n =3; Un(n) = [1, 0+1i, 1, 1]T n =4; Un(n) = [1, -0.70711-0.70711i, 0-1i, 1]Tn =5; Un(n) = [1, 0.70711-0.70711i, 0+1i, 1]Tn =6; Un(n) = [1, 0.70711+0.70711i, 0-1i, 1]Tn =7; Un(n) = [1, -0.70711+0.70711i, 0+1i, 1]Tn =8; Un(n) = [1, -1, 1, 1]T n =9; Un(n) = [1, 0-1i, -1, 1]T n =10; Un(n) = [1, 1, 1, 1]T n =11; Un(n) = [1, 0+1i, -1, 1]T n =12; Un(n) = [1, -1, -1, 1]T n =13; Un(n) = [1, -1, 1, 1]T n =14; Un(n) = [1, 1, -1, 1]T n =15; Un(n) = [1, 1, 1, 1]T The rotation matrix isMatrot(i)=I-2un (i)un (i)H /un (i)H un (i) The code word of the code -book of class 2 can be obtained together with the rotation matrix and with the collection of codeword B, according to the formula of matrix multiplication of the rotation operation. Considering that i = 0, then the following values can be obtained: i =0, j =0; CW2 = [0.82569, 0.32569, 0.32569, 0.32569]Ti = 0, j =1; CW2 = [0.32569, 0.57569-0.25i,0.32569, 0.57569+0.25i]T i =0, j =2; CW2 = [0.32569, 0.32569, 0.82569, 0.32569]Ti = 0, j =3; CW2 = [0.32569, 0.57569+0.25i,0.32569, 0.57569-0.25i]Ti=0, j =4; CW2 = [0.45069-0.30178i,0.62747+0.125i, 0.45069+0.051777i, 0.27392+0.125i]Ti=0, j =5; CW2 = [0.45069-0.051777i, 0.27392-0.125i, 0.45069+0.30178i, 0.62747-0.125i]Ti = 0, j =6; CW2 = [0.45069+0.051777i,0.27392+0.125i, 0.45069-0.30178i, 0.62747+0.125i]Ti = 0, j =7; CW2 = [0.45069+0.30178i, 0.62747-0.125i, 0.45069-0.051777i, 0.27392-0.125i]Ti = 0, j =8; CW2 = [0.32569, 0.82569, 0.32569,0.32569]Ti=0, j =9; CW2 = [0.57569-0.25i, 0.32569,0.57569+0 25i, 0.32569]Ti =0, j =10; 0.32569, 0.32569, CW2 = [0.32569, 0.82569]T i = 0, j =11; CW2 = [0.57569+0.25i, 0.32569,0.57569-0 25i, 0.32569]Ti =0, j =12; CW2 = [0.57569, 0.57569, 0.57569.0.075694]Ti = 0, j =13; CW2 = [0.57569, 0.57569, 0.075694.0.57569]T i = 0, j =14; CW2 = [0.57569, 0.075694, 0.57569.0.57569]T i = 0, j =15; CW2 = [0.075694, 0.57569, 0.57569,0.57569]T It should be noted in particular that the class 2 code word of the present invention is not restricted to the values cited above. PREFERRED ACHIEVEMENT 5 The present preferred embodiment essentially describes how to generate the codeword of the class 2 codebook by means of the phase adjustment algorithm according to the codeword of the class 1 codebook, and the constant method of this preferred embodiment can be used alongside the methods described in Preferred Embodiments 2-3 cited above. The phase of eNode B during obtaining the class 2 codebook codeword by calculation according to the phase adjustment algorithm includes the following phases. Each codeword in the class 1 codebook A has the corresponding phase adjustment matrix, the codeword of the class 2 codebooks NJ can finally be obtained by performing the phase adjustment on each element in the codeword. class 1 codebook A code; the phase adjustment operation being put into practice by multiplying the phase adjustment matrix by the codeword of the class 1 codebook, where NJ is a positive integer greater than 1; the phase adjustment operation is described using the following formula: CW2( i, j) = MatPhsAdj( j) • CW1( i) where CW1(i) represents the i° codeword of the class 1 codebook, and MatPhsAdj( j) is a matrix diagonal. 0j 1j (NT -1) j respectively represent to carry out the phase adjustment in the first element up to the (NT) ° element in CW1(i) , and their values are in the range of 0 to 2π or -π up to +π. CW2(i,j) represents to obtain the j° codeword in the NJ codewords by performing the phase adjustment on the i° of the class 1 codebook. In addition, the Y0 j, Y1j, ,Y(NT -i) j satisfies Yij (i + 1) θj, where i = 0.1,L, NT-1 , j = 0.1,L, NJ , θj is a phase value and its value is found in the range from 0 to 2π or from -π to +π, and where NJ is a positive integer greater than 1. Hereinafter, we will present another more specific example: assuming that the number of transmit antenna ports -d- is NT = 4, then the class 2 codebook will be defined directly in R10, and if some class of codebook index, some class 2 codebook index value and some value of the total amount of layers, the corresponding complex matrix can be defined directly in R10, that is, the code word of the class 2 codebook. For example, assuming that the total known number of layers is u = 1, that the class 1 and class 2 codebook indices are respectively indicated as -i- and as -j-, 1 2 , then the word decode of the class 2 codebook will be indicated as CW2, while the codeword of the class 1 codebook will be indicated as CW1.u = 1 and -i- are given, the codeword definition of Class 1 codebook is as follows: i=0; CW1 = [0.5, 0.5, 0.5, 0.5] Ti =1; CW1 = [0.5, 0+0.5i, -0.5, 0-0.5i]Ti =2; CW1 = [0.5, -0.5, 0.5, -0.5]Ti =3; CW1 = [0.5, 0-0.5i, -0.5, 0+0.5i]T i =4; CW1 = [0. 5, 0.35355+0.35355i, 0+0.5i, -0.35355+0.35355i]T i =5; CW10.35355+0.35355i]T = [0.5, -0.35355+0.35355i, 0-0.5i,i =6; CW10.35355-0.35355i]T = [0.5, -0.35355-0.35355i, 0+0.5i,i =7; CW10.35355-0.35355i]T = [0. 5, 0.35355-0.35355i, 0-0.5i, -i =8; CW1 = [0.5, 0.5, -0.5, -0.5]T i =9; CW1 = [0.5, 0+0.5i, 0.5, 0+0.5i]T i =10; CW1 = [0.5, -0.5, -0.5, 0.5]T i =11; CW1 = [0.5, 0-0.5i, 0.5, 0-0.5i]T i =12; CW1 = [0.5, 0.5, 0.5, -0.5]T i =13; CW1 = [0.5, 0.5, -0.5, 0.5]T i =14; CW1 = [0.5, -0.5, 0.5, 0.5]T i =15; CW1 = [0.5, -0.5, -0.5, -0.5]T Assuming that θj=0 = -3π/32θj=1 =-π/32 θj=1 =-π/32phase will be as follows: Assuming i = 0, then there will be generated■ 4θ])CW1(i=0) = [0.5, 0.5, 0.5, 0.5] and the 4 codewords of the codebook of class 2.The codewords of the codebook of class 2 then generated will be as follows: CW2(0,0) = MatPhsAdj( j = 0) ■ CW1(i = 0)0.1397i,0.4801 + 0.1397i]T CW2(0,1) = MatPhsAdj( j = 1) • CW1( i = 0) =[0.5000, 0.2702 - 0.4207i, -0.2081 - 0.4546i, - 0.2081 - 0.4546i]TCW2(0, 2) = MatPhsAdj(j = 2) • CW1(i = 0)=[ 0.5000, 0.2702 + 0.4207i, -0.2081 + 0.4546i, - 0.2081 + 0.4546i]TCW2(0, 3) = MatPhsAdj(j = 3) • CW1(i = 0)=[0.5000, -0.4950 + 0.0706i, 0.4801 - 0.1397i,0.4801 - 0.1397i]T It should be noted in particular that the value of the class 2 codebook codeword is not limited to the examples described above. In Preferred Embodiments 2 and 3, when class 2 codebook codewords are generated, they can be generated using the method contained in Preferred Embodiment 4 separately, as they can be generated using separate the method contained in Preferred Embodiment 5, or a portion of the codewords of the class 2 codebook may be generated using the method described in Preferred Embodiment 4 by a portion of the codewords of the class codebook 1, while the remaining codewords of the class 2 codebook can be generated using the method described in Preferred Embodiment 5 by another part of the codewords of the class 1 codebook. In particular, for a part of the code-book A codewords of class 1, each one of them presents the corresponding phase adjustment matrix, with the phase adjustment being performed on each element in the code-book code words The class 1 code, and finally, the codewords of the class 2 codebook are obtained, a process that is similar to the method described in Preferred Embodiment 5; each of the other codewords in the class 1 codebook A presents the corresponding rotation matrix, and each codeword in a known collection of codeword B rotates to the adjacency of a class 1 codeword in the code -book A of class 1 to finally get the codewords of the codebook of class 2, which process is similar to the method described in Preferred Embodiment 4. Next, we describe the specific example of this hybrid mode, as follows: The class 1 codebook is a Rel-8 codebook, and the codewords of the class 2 codebook are obtained through the extension of the codewords of the class 1 codebook; there are two extension ways to improve the feedback accuracy of the different types of channels; the previous 8 codewords in the R8 codebook are DFT codewords, which are suitable for the relevant channels. The following extension of the previous 8 codewords is used to generate part of the codewords of the class 2 codebook. In this case, i = 0, 1, 2, ♦♦♦ , 7, and j = 0, 1, 2, 3the previous 8 codewords in codebook R8 are DFT codewords that are suitable for irrelevant channels. The following extension of the previous 8 codewords is used to generate the remaining part of the codewords of the class 2 codebook. In this case, i = 8, 9, ..., 15 and j = 0, 1, 2, 3; with respect to a UMi channel, α = 0.5; and no, which refers to a 3GPP Casel channel, α = 0.2. Obtaining different codewords by selecting different algorithms will depend on the simulation result, and the selected objective is to maximize system traffic or maximize system efficiency. PREFERRED ACHIEVEMENT 6 As illustrated in Figure 1, we will now describe the general processing procedure for dynamic transmission mode switching between single-user MIMO and multi-user MIMO, which comprises the following steps, as follows: In step S101, the transmitting terminal eNB sends the pilot reference information of the downlink channel information to a user equipment (UE) for the user equipment to test the status of the downlink channel; in step 103, the UE performs the calculating the downlink channel according to the received pilot information; in step 105, the UE determines the format to feed back the channel state information including a class 1 codebook index and a codebook index of class 2; in step 107, the UE communicates channel status information including a class 1 codebook index and a class 2 codebook index to the eNB; in step 109, the eNB dynamically selects the SU-MIMO transmission mode or downlink MU-MIMO transmission mode, according to the communicated channel status information, using the class 1 codebook index to obtain the codeword of the codebook of class 1 in SU-MIMO transmission mode, uses the code-book index of c lasse 2 to obtain the codeword of the class 2 codebook in the MU-MIMO transmission mode, and communicate with the UE by generating a weight using the codeword obtained according to the selected transmission mode. PREFERRED ACHIEVEMENT 7 As illustrated in Figure 2 below, we will now describe the general processing procedure for dynamic transmission mode switching between single-user MIMO and multi-user MIMO, as follows: In step 201, the transmitting terminal eNB sends the pilot reference information of the downlink channel information to a user equipment (UE) for the user equipment to test the status of the downlink channel; in step 203, the UE performs the calculating the downlink channel according to the received pilot information; in step 205, the UE determines the format to feed back the channel state information, including a class 2 codebook index; in step 207, the UE communicates to the eNB the channel state information, including the class 2 codebook index; in step 209, the eNB dynamically selects the SU-MIMO transmission mode or the downlink MU-MIMO transmission mode, according to the communicated channel state information, using the class 2 codebook index to deduce the class 1 codebook index, so as to obtain the codeword of the class 1 codebook in transmission mode SU-MIMO, directly uses the class 2 codebook index to obtain the codeword of the class 2 codebook in the MU-MIMO transmission mode, and communicate with the UE by generating a weight using the codeword obtained according to the selected transmission mode. The system that puts into practice the method described above includes a UE and an eNode B, wherein the UE is configured to communicate the codebook index information and the total amount of layers information to the eNode B, wherein codebook index information includes one of the following information: class 2 codebook index 1; and index -i- and the index parameter -j- of the class 1 codebook; ewherein the eNode B is configured to, after having received the information about the codebook index and the information about the total amount of layers sent by the UE, to obtain a codeword by the eNode B in the form of looking up a list of preset codebooks or in the form of querying a list of the preset codebook together with calculations according to the codebook index information and the total number of layers information. Refer to the method described above for UE and eNode B specific operations. In light of and according to the present invention, the method can provide the channel status information with sufficient accuracy for the MU-MIMO system. It should be noted in particular that, in the absence of any divergence, the preferred embodiments contained in the present invention as well as the various features in the preferred embodiments can be combined with one another, all of which are covered by the scope of protection of the present invention. Furthermore, the phases illustrated in the flowcharts of the attached drawings can be elaborated in a computerized system, as instruction sets executable on computers and, although the logical orders are shown in the flowcharts, the illustrated or described phases can be carried out in a different order of the one presented here in certain cases. INDUSTRIAL APPLICABILITY In the present invention, on the one hand, the network side can be compatible to use the channel state information format of R8 to put into practice the multi-antenna function of the R8 release, such as single-user MIMO ; on the other hand, the network side significantly reduces quantization errors in the form of a new R10 codebook, thereby dramatically improving the performance of the MU-MIMO system. Through the new method for the generation and representation of a new code-book, the transmission efficiency and the transmission quality can be improved, thus solving the problem related to the lack of precise information of the MU-MIMO about the channel state.
权利要求:
Claims (7) [0001] 1. METHOD FOR THE ACQUISITION OF INFORMATION ON THE STATE OF THE CHANNEL, characterized by comprising: an eNode B (eNB) that receives information about the code-book index and information about the total amount of layers sent by a user equipment (UE), wherein the codebook index information comprises a first class codebook index i and an index parameter j; and eNode B gets a codeword [“codeword”] in the form of querying a list of predefined codebooks using the index i of the first class codebook, the index parameter j and the total number of layers u as an index , with the list of predefined codebooks including a table 2, in relation to table 2, if the index i of the first class codebook and the total number of layersu are given, a unique complex matrix AMaty will be given directly, where i = 0.1, L.2 1 - 1 , AMativ represents a codeword of a first class codebook and is an NT represents the number of antenna ports doeNode B (eNB). [0002] 2. METHOD, according to claim 1, characterized by, the predefined code-book list includes a table1; in relation to table 1, if given an index i, an index parameter j of a codebook of the first class, and the total number of layers U, the matrix that i = 0.1,L, 2 1 , j = 0 ,1,L,2 2 , CMatj represents a codeword of a second class codebook and is a complex matrix, NB1 and NB2 are positive integers greater than 0 and respectively representing the size of the first class codebook and the second-class codebook2, where CMatj is an NT x1 matrix or an N x 2 matrix; and T;NT represents the number of antenna ports of eNode B (eNB). [0003] 3. METHOD, according to claim 1, characterized in that eNode B obtains a codeword by applying: a phase adjustment calculation comprising: performing the phase adjustment on each element in the codeword of the first class codebook to finally get NJ codewords from the second class codebook, NJ is a positive integer greater than 1, and multiplying the phase adjustment matrix by the codeword from the first class codebook, and the phase adjustment matrix is generated according to the code word of the first class codebook. [0004] 4. METHOD, according to claim 3, characterized in that the phase adjustment is performed, using the following formula: CW2(i, j) = MatPhsAdj(j) • CW1(i), where CW1(i) represents the ith codeword of the first class codebook, and where MatPhsAdj( j) is a diagonal matrix, [0005] 5. METHOD according to claim 4, characterized in that Yoj, Y1 j,L, Y(NT-1)j satisfies Yij =(i + 1)θj, where i = 0.1,L,NT-1 , j = 0.1,L, NJ , and θj is a phase value, which is in the range 0 to 2π or from -π to -π , and NJ is a positive integer greater than 1. [0006] 6. METHOD, according to claim 1, characterized in that it further comprises the following elements: the eNode B that schedules the UE by designating the obtained codeword, selecting the way of transmission of the downlink to communicate with the UE, in which the The downlink transmission mode comprises one of the following elements: multiple input multiple output transmission mode for single user, multiple input multiple output transmission mode for multiple users, dynamic switched transmission mode for single user/multiple users, and coordinated transmission mode by multiple points. [0007] 7. SYSTEM FOR THE ACQUISITION OF INFORMATION ON THE STATE OF THE CHANNEL, characterized in that it comprises a user equipment (UE) and an eNode B (eNB), in which the UE is configured to communicate information about the code-book index and the information about the total amount of layers for the eNode B, wherein the codebook index information comprises a first class codebook index i and an index parameter j; the eNode B is configured to receive the information about the codebook index and the information about the total number of layers sent by the UE, obtain a codeword [“codeword”] in the form of querying a list of predefined codebooks using the codebook index i first class, the j index parameter and the total number of layers U as an index, with the list of predefined codebooks including a table 2, in relation to table 2, if the index i of the first class codebook is given and the total number of layersu, a matrix unique complex AMat y will be given directly, where i = 0.1, L.2 1 - 1 , AMativ represents a codeword of a first class codebook and is oneNT represents the number of antenna ports of the Node B (eNB) antenna ).
类似技术:
公开号 | 公开日 | 专利标题 BR112012010754B1|2021-06-01|METHOD FOR THE ACQUISITION OF INFORMATION ON THE STATE OF THE CHANNEL AND SYSTEM FOR THE ACQUISITION OF INFORMATION ON THE STATE OF THE CHANNEL CN107636984B|2021-08-20|Method and apparatus for operating MIMO measurement reference signals and feedback US10630355B2|2020-04-21|Methods and devices for determining precoder parameters in a wireless communication network JP6621830B2|2019-12-18|Method and apparatus for reduced feedback FD-MIMO US9350432B2|2016-05-24|Method and apparatus for acquiring a precoding matrix indicator and a precoding matrix US11025322B2|2021-06-01|Progressive advanced CSI feedback US10998949B2|2021-05-04|Multi-beam codebooks with further optimized overhead US9491654B2|2016-11-08|Method and apparatus for reporting channel state information in wireless communication system US20210242917A1|2021-08-05|Method and device for transmitting and receiving feedback signal in wireless communication system US9432099B2|2016-08-30|Method and apparatus for reporting channel state information in wireless communication system US10374678B2|2019-08-06|Channel state information feedback method and apparatus CN101834707B|2016-03-30|A kind of obtain channel condition information method and corresponding communication system JP2019537874A|2019-12-26|Precoding matrix indicating method, apparatus, and system US10574409B2|2020-02-25|Information notification method and channel state information process execution method BR102012000224A2|2013-06-04|Method and apparatus for determining a pre-encoding vector for pre-encoding data to be transmitted to a wireless device and a wireless communication system. CN104348590B|2019-02-01|Method, terminal and the base station for obtaining precoding of feeding back channel state information US10469142B2|2019-11-05|Advanced CSI reporting for hybrid class A/B operation Penna et al.2016|Low complexity precoder selection for FD-MIMO systems CN109845126B|2022-03-15|Multi-beam codebook with further optimized overhead
同族专利:
公开号 | 公开日 KR20120048041A|2012-05-14| BR112012010754A2|2020-09-08| JP5715649B2|2015-05-13| JP2013520045A|2013-05-30| US8908811B2|2014-12-09| EP3416299A1|2018-12-19| EP2477342A1|2012-07-18| US20120207240A1|2012-08-16| CN101800628B|2015-09-16| WO2011097902A1|2011-08-18| EP2477342A4|2017-05-10| KR101411474B1|2014-06-24| RU2508598C2|2014-02-27| RU2508598C9|2014-06-27| EP2477342B1|2018-08-29| CN101800628A|2010-08-11|
引用文献:
公开号 | 申请日 | 公开日 | 申请人 | 专利标题 GB0321093D0|2003-09-09|2003-10-08|Nokia Corp|Multi-rate coding| CN100550685C|2005-10-05|2009-10-14|中兴通讯股份有限公司|The method and system of down link self adaption in the multiuser mimo system| KR100819285B1|2006-03-16|2008-04-02|삼성전자주식회사|Method for transmiting/receiving feedback information in a multi-antenna system of selporting multi-user and system thereof| TWI343200B|2006-05-26|2011-06-01|Lg Electronics Inc|Method and apparatus for signal generation using phase-shift based pre-coding| CN101166052B|2006-10-19|2012-05-23|株式会社Ntt都科摩|Precoding method for multi-input multi-output system and apparatus using same| US20080268785A1|2007-04-30|2008-10-30|Mccoy James W|UE-autonomous CFI reporting| KR101537591B1|2008-04-07|2015-07-20|엘지전자 주식회사|Method for mode adaptation in MIMO system| KR101603338B1|2008-08-11|2016-03-15|엘지전자 주식회사|Method and apparatus of transmitting information in wireless communication system| US20110170427A1|2010-01-11|2011-07-14|Nokia Corporation|Best Companion PMI-Based Beamforming| CN101800628B|2010-02-12|2015-09-16|中兴通讯股份有限公司|A kind of method and system obtaining channel condition information|CN101800628B|2010-02-12|2015-09-16|中兴通讯股份有限公司|A kind of method and system obtaining channel condition information| CN101917365B|2010-08-16|2015-06-03|中兴通讯股份有限公司|Method, device and system for configuring codebook| KR101806878B1|2010-08-16|2018-01-10|삼성전자주식회사|Codebook for 8 transmission antennas and multiple input multiple output communication system of the codebook| JP5585306B2|2010-08-25|2014-09-10|ソニー株式会社|BASE STATION, RADIO COMMUNICATION DEVICE, RADIO COMMUNICATION SYSTEM, RADIO COMMUNICATION METHOD, AND PROGRAM| CN102468925B|2010-11-09|2014-05-28|大唐移动通信设备有限公司|Precoding matrix index reporting and precoding processing method, system and apparatus thereof| CN102045762B|2010-12-02|2013-07-24|大唐移动通信设备有限公司|Method and device for reporting channel state| EP2677679B1|2011-02-14|2019-12-11|ZTE Corporation|Method and system for precoding open loop spatial multiplexing and precoding indication method| WO2011157182A2|2011-06-03|2011-12-22|华为技术有限公司|Method, device and system for transmitting channel state information| WO2013053135A1|2011-10-14|2013-04-18|Nokia Siemens Networks Oy|Method for allocating a transmission mode to a user equipment and apparatus thereof| BR112014011040A2|2011-11-07|2017-06-13|Motorola Mobility Llc|csi return method and apparatus for joint processing schemes in a coordinate multiple point transmission orthogonal frequency division multiplexing communication system| GB2496458A|2011-11-14|2013-05-15|Renesas Mobile Corp|Transmission of channel state information| CN103220090B|2012-01-19|2017-03-22|中国移动通信集团公司|Codebook feedback method, signal receiving device, signal transmission method and signal transmission device| IN2015MN00558A|2012-11-09|2015-07-31|Lg Electronics Inc| JP6306052B2|2013-01-14|2018-04-04|エルジー エレクトロニクス インコーポレイティド|Method and apparatus for reporting channel state information for 3-dimensional beamforming in a wireless communication system| CN103945536B|2013-01-17|2017-09-19|上海贝尔股份有限公司|Support the carrier structure and resource allocation methods of separate configurations| US9294172B2|2013-01-25|2016-03-22|Lg Electronics Inc.|Method and apparatus for reporting downlink channel state| WO2014139088A1|2013-03-12|2014-09-18|华为技术有限公司|Power control method and device| US9768849B2|2013-04-04|2017-09-19|Lg Electronics Inc.|Method and apparatus for reporting channel status information in wireless communication system| JP6194952B2|2013-04-23|2017-09-13|富士通株式会社|COMMUNICATION SYSTEM, COMMUNICATION METHOD, USER TERMINAL, CONTROL METHOD, AND CONNECTION BASE STATION| KR102160008B1|2013-06-17|2020-09-25|삼성전자 주식회사|Method and apparatus for transmitting and receiving channerl state information| CN104348590B|2013-07-25|2019-02-01|中兴通讯股份有限公司|Method, terminal and the base station for obtaining precoding of feeding back channel state information| CN104348575A|2013-07-26|2015-02-11|中兴通讯股份有限公司|Pre-coding matrix feedback method and terminal| CN104811229B|2014-01-24|2020-09-08|中兴通讯股份有限公司|Channel state information processing method and device, terminal and base station| CN104883236B|2014-02-28|2019-03-15|中兴通讯股份有限公司|A kind of multi-input multi-output system and its transmission method and user equipment| WO2017080132A1|2015-11-12|2017-05-18|Intel IP Corporation|System and method for channel quality measurement in single user super imposed transmission| CN107872259B|2016-09-27|2020-10-27|电信科学技术研究院|Codebook generation method and communication equipment| CN110050477A|2016-09-29|2019-07-23|夏普株式会社|Base station apparatus, terminal installation and communication means| CN106708786A|2016-12-25|2017-05-24|杭州博烁晟斐智能科技有限公司|Method and system for calculating problem severity of iron tower based on sensor detection| CN109150411B|2017-06-16|2021-06-18|北京紫光展锐通信技术有限公司|Channel state information reporting method and device and user equipment| CN109560847A|2017-09-26|2019-04-02|华为技术有限公司|Information feedback and method of reseptance, sending ending equipment and receiving device| CN113301602B|2021-05-13|2022-02-08|深圳市云之声科技有限公司|5G intelligent gateway|
法律状态:
2020-09-15| B06U| Preliminary requirement: requests with searches performed by other patent offices: procedure suspended [chapter 6.21 patent gazette]| 2020-09-24| B15K| Others concerning applications: alteration of classification|Free format text: AS CLASSIFICACOES ANTERIORES ERAM: H04B 7/04 , H04L 1/06 Ipc: H04B 7/0417 (2017.01), H04B 7/06 (2006.01), H04B 7 | 2021-04-06| B09A| Decision: intention to grant [chapter 9.1 patent gazette]| 2021-06-01| B16A| Patent or certificate of addition of invention granted|Free format text: PRAZO DE VALIDADE: 20 (VINTE) ANOS CONTADOS A PARTIR DE 02/11/2010, OBSERVADAS AS CONDICOES LEGAIS. PATENTE CONCEDIDA CONFORME ADI 5.529/DF |
优先权:
[返回顶部]
申请号 | 申请日 | 专利标题 CN201010125662.3|2010-02-12| CN201010125662.3A|CN101800628B|2010-02-12|2010-02-12|A kind of method and system obtaining channel condition information| PCT/CN2010/078341|WO2011097902A1|2010-02-12|2010-11-02|Method and system for acquiring channel state information| 相关专利
Sulfonates, polymers, resist compositions and patterning process
Washing machine
Washing machine
Device for fixture finishing and tension adjusting of membrane
Structure for Equipping Band in a Plane Cathode Ray Tube
Process for preparation of 7 alpha-carboxyl 9, 11-epoxy steroids and intermediates useful therein an
国家/地区
|